Efficient Scheduling Algorithm with Fault-tolerance for Real-time Tasks in Distributed Systems

As real-time fault-tolerant scheduling is one of the main research areas in real-time fault-tolerant techniques, this paper proposes an efficient scheduling algorithm for BKCL(EBKCL). EBKCL can schedule the tasks with the fault-tolerant requirements(FTR) together with tasks without FTR. It is assumed in BKCL that there are no overlaps between the backup copies, however, the backup copies are allowed to be overlapped in EBKCL. The simulation experiment shows that the performance of EBKCL is better than that of BKCL. In order to enhance the performance of the BKCL, a dynamic scheduling algorithm is proposed, the performance simulation and analysis of DSA are also given in this paper.